On the Ramsey Multiplicity of the Odd Cycles
نویسندگان
چکیده
The Ramsey multiplicity R(G) of a graph G is the minimum number of monochromatic copies of G in any two-colouring of the edges of Kr(G), where r(G) denotes the Ramsey number of G. Here we prove that odd cycles have super-exponentially large Ramsey multiplicity: If Cn is an odd cycle of length n, then logR(Cn) = Θ(n logn).
منابع مشابه
Generalized Ramsey Theory for Multiple Colors
In this paper, we study the generalized Ramsey number r(G, , . . ., Gk) where the graphs GI , . . ., Gk consist of complete graphs, complete bipartite graphs, paths, and cycles. Our main theorem gives the Ramsey number for the case where G 2 , . . ., G,, are fixed and G, ~_C, or P,, with n sufficiently large . If among G2 , . . ., G k there are both complete graphs and odd cycles, the main theo...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملA multipartite Ramsey number for odd cycles
In this paper we study multipartite Ramsey numbers for odd cycles. Our main result is the proof of a conjecture of Gyárfás, Sárközy and Schelp [12]. Precisely, let n ≥ 5 be an arbitrary positive odd integer; then in any two-coloring of the edges of the complete 5-partite graph K(n−1)/2,(n−1)/2,(n−1)/2,(n−1)/2,1 there is a monochromatic cycle of length n. keywords: cycles, Ramsey number, Regular...
متن کاملCycles Are Strongly Ramsey-Unsaturated
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H. This notion was introduced by Balister, Lehel and Schelp in [2], where it is shown that cycles (except for C4) are Ramsey-unsaturated, and conjectured that, moreover, one may add any chord without changing the Ramsey number of the cycle Cn, u...
متن کاملRamsey Numbers of Trees Versus Odd Cycles
Burr, Erdős, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that R(Tn, Cm) = 2n− 1 for all odd m > 3 and n > 756m10, where Tn is a tree with n vertices and Cm is an odd cycle of length m. They proposed to study the minimum positive integer n0(m) such that this result holds for all n > n0(m), as a function of m. In this paper, we show that ...
متن کامل